Higher-Order Rewriting: Framework, Confluence and Termination
نویسنده
چکیده
ion: Γ · {x : σ} `F t : τ Γ `F (λx : σ.t) : σ → τ Application: Γ `F s : σ → τ Γ `F t : σ
منابع مشابه
Higher - Order ( Non - ) Modularity Claus
We show that, contrary to the situation in first-order term rewriting, almost none of the usual properties of rewriting are modular for higher-order rewriting, irrespective of the higher-order rewriting format. We show that for the particular format of simply typed applicative term rewriting systems modularity of confluence, normalization, and termination can be recovered by imposing suitable l...
متن کاملHigher-Order (Non-)Modularity
We show that, contrary to the situation in first-order term rewriting, almostnone of the usual properties of rewriting are modular for higher-order rewriting, irre-spective of the higher-order rewriting format. For the particular format of simply typedapplicative term rewriting systems we prove that modularity of confluence, normalization,and termination can be recovered by impo...
متن کاملProving Termination of Rewriting with the Dependency Pair Framework
Termination is besides confluence the most important and fundamental property of term rewriting systems (TRSs). If a TRS is terminating, then this guarantees that every strategy of computing with the system will always end with normal forms. But unfortunately, the undecidability of termination shows that there cannot be an automated method that will succeed in proving termination of all termina...
متن کاملRelative Termination
"Relative termination" is a property that generalizes both termination and "termination modulo". In order to prove that a term rewrite system relatively terminates, one may reuse the common termination quasiorderings. Further proof methods become available by the cooperation property. Relative termination sets up new proof techniques for termination and confluence. The usefulness of the notion ...
متن کاملDiagrams for Meaning Preservation
This paper presents an abstract framework and multiple diagram-based methods for proving meaning preservation, i.e., that all rewrite steps of a rewriting system preserve the meaning given by an operational semantics based on a rewriting strategy. While previous rewriting-based methods have generally needed the treated rewriting system as a whole to have such properties as, e.g., confluence, st...
متن کامل